On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs
نویسندگان
چکیده
منابع مشابه
Edge irregular total labellings for graphs of linear size
Confirming a conjecture by Ivančo and Jendrol’ for a large class of graphs we prove that for every graph G = (V,E) of order n, size m and maximum degree ∆ with m > 111000∆ there is a function f : V ∪ E → { 1, 2, ..., ⌈ m+2 3 ⌉} such that f(u) + f(uv) + f(v) 6= f(u′) + f(u′v′) + f(v′) for every uv, u′v′ ∈ E with uv 6= u′v′. Furthermore, we prove the existence of such a function with values up to...
متن کاملIrregular Labellings of Circulant Graphs
We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1, 2, . . . , k) and prove that tvs(Cin(1, 2, . . . , k)) = ⌈ n+2k 2k+1 ⌉ , while s(Cin(1, 2, . . . , k)) = ⌈ n+2k−1 2k ⌉ except if either n = 2k + 1 or if k is odd and n ≡ 2k + 1(mod4k), then s(Cin(1, 2, . . . , k)) = ⌈ n+2k−1 2k ⌉ + 1.
متن کاملOn irregular total labellings
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularity strength, are introduced. Estimations on these parameters are obtained. For some families of graphs the precise values of these parameters are proved. © 2006 Elsevier B.V. All rights reserved.
متن کاملEdge-Magic Group Labellings of Countable Graphs
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers Z, there is such a labelling whenever the graph has an infinite set of disjoint edges. A graph without an infinite set of disjoint edges must be some subgraph of H + I, where H is some finite graph and I is a countable...
متن کاملThe Edge Span of Distance Two Labellings of Graphs
The radio channel assignment problem can be cast as a graph coloring problem. Vertices correspond to transmitter locations and their labels (colors) to radio channels. The assignment of frequencies to each transmitter (vertex) must avoid interference which depends on the seperation each pair of vertices has. Two levels of interference are assumed in the problem we are concerned. Based on this c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2017
ISSN: 2227-7390
DOI: 10.3390/math5040067